perm filename JAN76.OUT[LET,JMC]1 blob
sn#203303 filedate 1976-02-26 generic text, type T, neo UTF8
∂26-FEB-76 0230 JMC E on Imlac
To: ME
Is there a way to make substitution commands using E on the Imlac?
The \ indicating substitution becomes part of the search string.
∂25-FEB-76 1507 JMC
To: RWW
I have done four out of the five accomplishments and four out of the
needed five goals. Please do one more of each and add it to
accomp[w76,jmc] before you leave.
∂24-FEB-76 1028 JMC
CC: moore @ MIT-AI, LES, phw @ MIT-AI
Perhaps you should spend a final term as an M.I.T. research assistant.
∂23-FEB-76 2303 JMC
To: LES, moore @ MIT-AI
CC: phw @ MIT-AI
It seems that the problem is mainly the M.I.T. tuition. M.I.T. and
Stanford handle the tuition problem for research assistants
differently, but the first order result is the same. Stanford gives
its RA's free tuition without charging it directly to contracts, but
it is quite unlikely that Stanford can be persuaded to pay M.I.T.
tuition. It seems to me that the solution is for M.I.T. to waive its
tuition while you are here.
∂20-FEB-76 1750 JMC
To: DAustin @ MIT-MULTICS
Glad to accept invitation to Data Base workshop.
∂20-FEB-76 1416 JMC BUG
To: REM
While logged in as ESS,JMC, I had the dialog:
ru cru2[1,rem]
COMMAND ..etc.
Crunch
INPUT FILE NAME
hoter.ess[w76,jmc]
OUTPUT (CRUNCHED FILE NAME:
foo
INCLUDED HISTORY TREE?Y
INCLUDED HUFFMAN TREE?y
(NO SUCH FILE) (NEED TO LOAD HISTORY TREE FIRST) (E/TV FILE INIT'D OK)
Ill mem ref at user 15242
↑C
∂20-FEB-76 0503 JMC
To: REM
Unfortunately, I am going to Boston tomorrow, have just finished my
paper and won't be able to get back to it till next week.
∂19-FEB-76 1646 JMC
To: REG
I stand corrected
∂19-FEB-76 0215 JMC
To: MM
He is said to be asleep on the couch in the TV room, I'll check.
∂19-FEB-76 0141 JMC
To: REM
OK, thanks. By the way, I mentioned your garbaging problem to Panofsky
who said he hadn't heard of it, made a few tests and speculated that
your terminal was misbehaving. I suggest you send him a message with
evidence of malfunction.
∂19-FEB-76 0136 JMC
To: REM
I don't know about running things through ptyjobs - never done it. Is
it described in monitor manual. I will not have time to do much until
next Tuesday, because I am getting a paper finished for the AAAS meeting
in Boston. Delayed reaction: I think the initial system should have
different programs for crunching different kinds of files and the user
should choose the program. Such a system will be simpler to maintain.
I will be here for only another few minutes.
∂18-FEB-76 1529 JMC
To: REG
The correct English word is "IMPURE".
∂18-FEB-76 1419 JMC
To: REM
CC: REG
∂18-FEB-76 0905 REM
A crude version with user-level scanner now exists, CRU2.DMP[1,REM]
It will remain crude until the user-level syntax is decided upon.
I haven't received any feedback fromyou yet re$ardin$ CRUCOM.PRO
crucom.pro looks ok, except that "crunch foo" should have the
effect of "crunch foo←foo". I am asking reg for an opinion.
SPINDL will pose more problems.
∂18-FEB-76 1413 JMC
To: LES
∂18-FEB-76 0212 DCL Gerard Huet summer visit
Huet's summer visit could come out of savings on my
salary while at Harvard.
suggestions:
one month...per diem consulting, total cost about $1000
three moths...regular ress assoc. salary $1400 per month.
I'm not sure how long he wants to come for and will cable
to ask him after you reply to this.
-David
∂18-FEB-76 0016 JMC
To: ELF
Yes,if that's all you'll miss.
∂17-FEB-76 1840 JMC
To: HQM
As you may have guessed, I view this with equanimity.
∂17-FEB-76 1546 JMC
To: EK
Using two data disk channels in afternoon is frowned upon.
∂16-FEB-76 1607 JMC
To: REM
I suggest you prepare a few sample dialogs.
∂16-FEB-76 1533 JMC
To: REM
Yes, it looks good enough to try on users, so the next point is the
human engineering which I will want to try before inflicting it. I
suggest that the version of the cruncher be stored with each crunched
file so that changes can be made occasionally without requiring everyone
to uncrunch and recrunch. File ages are unreliable if crunched files
are copied.
∂16-FEB-76 1213 JMC
To: BPM, LES
Sure it will prove useful, and I am happy that you are volunteering.
∂15-FEB-76 1418 JMC
To: PAW
Please see if you can find the letter from Culik and complete the
address on culik.le1.
∂15-FEB-76 1155 JMC
To: phw @ MIT-AI
Marvin showed me a copy of your notes for a book on AI. Can you
send me a copy, especially the introduction to LISP?
∂14-FEB-76 0030 JMC Your account at SU-AI
To: ef @ MIT-AI
I have put a remote password on your account here so you can
log in remotely. The password is mosquito
∂13-FEB-76 1335 JMC Admissions data processing
To: WTL
The ratings on the folders need to be processed for calibration and
normalization. Last year Curt Widdoes did this; I think he did it
here and I think the same programs can be used this year. Would you
take charge of this?
∂13-FEB-76 1321 JMC
To: JBR
Here is a message from Cerf that refers to something you said:
∂13-FEB-76 1239 CRF via ISI NSF DIAL-NET PROPOSAL
To: LES, JMC
LES AND JOHN -
I AM SORRY NOT TO HAVE FULFILLED MY PART OF THE TEXT
GENERATION. THINGS HAVE GOTTEN FAIRLY OUT OF HAND SINCE WE
TALKED IN DECEMBER -- LIKE THE CS AND EE COMPREHENSIVE/QUAL
OCCURRING CONCURRENTLY AND OTHER COMMITTMENTS (LIKE TO ARPA)
HAVE GOTTEN IN THE WAY. I HOPE YOU DID SEND OUT THE PROPOSAL
ANYWAY. MY INFORMATION IS THAT CABLEDATA ASSOCIATES (PAUL BARAN AND
PROF. ED PARKER/COMMUNICATIONS DEPT.) HAVE A PROPOSAL UNDER REVIEW
WHICH PROPOSES TO DESIGN AND BUILD A MESSAGE HANDLING SYSTEM
USING DIALED TELEPHONE LINES AND MICROPROCESSORS. THEIR
IDEA DIFFERS FROM DIAL-NET IN THE SENSE THAT THEY DID NOT PROPOSE
THAT THEIR MESSAGE SYSTEM BE COMPATIBLE WITH THAT OF THE ARPANET.
I DON'T THINK THEY HAD IN MIND THAT THE MICROPROCESSOR WOULD SPEAK TO
HOSTS AS IF THEY WERE HOSTS, BUT RATHER AS SIMPLE TERMINALS. THERE
IS SOME QUESTION ABOUT THE NUMBER AND LEVEL OF PROTOCOLS INVOLVED.
JEFF RUBIN'S CONCERN OVER THE DELAY (NOT THE RELATIVE OVERHEAD) OF
PROTOCOLS ON RELATIVELY LOW SPEED LINES (E.G. 300 BAUD) IS WELL TAKEN.
HOWEVER, TO ACHIEVE ANYTHING LIKE THE RELIABILITY OF THE ARPANET
MESSAGE SYSTEM, IT WILL BE NECESSARY TO INTRODUCE AT LEAST AN SDLC OR
HDLC LIKE LINE CONTROL PROCEDURE JUST TO HANDLE SEQUENCING, DULICATE
DETECTION, AND FLOW CONTROL. ON TOP OF THAT, ONE WOULD EXPECT TO SEE
SOME MINIMAL KIND OF MESSAGE FORMAT, BUT THIS NEEDN'T INVOLVE ANY
SPECIAL CHARACTERS OR PROTOCOL, BUT RATHER MERELY
PRESENT A UNIFORM TEXTUAL APPEARANCE WITH LABELLED FIELDS LIKE
"TO:", "FROM:", "CC:", "SUBJECT:", AND THE LIKE. SDLC AND
HDLC ARE BIT STUFFING PROTOCOLS AND SOME PEOPLE HAVE CHOSEN TO
IMPLEMENT VARIANTS WHICH USE THE OLD ASCII SYN/SYN/DLE/SOH/
<HEADER>/DLE/SOM/<MESSAGE>/DLE/ETX/CRC/CRC/CRC... FORMAT, IN WHICH
THE HEADER CONTAINS INDEPENDENT NUMBERING IN EACH DIRECTIONS SO
AS TO EMULATE THE INTENTION OF SDLC/HDLC WITHOUT BIT
STUFFING.
THERE REMAINS APROBLEM WITH THE INTEGRATION OF SUCH A STRATEGY (LINE CONTROL
PROCEDURE + TEXT FORMAT) WITH EXISTING ARPANET HOST SOFTWARE, SINCE
THE HOST-HOST AND FTP LEVELS WOULD BE MISSING. A POSSIBLE SOLUTION
TO THIS PROBLEM IS TO INTRODUCE A SUBSYSTEM IN ARPANET HOSTS
WHICH IS WAITING FOR CALLS ON KNOWN MODEMS AND WHICH WILL BE PLUGGED
INTO THE MESSAGE SYSTEM AT A LEVEL ABOVE THE FTP; ALMOST LIKE USER
TYPING TO MAIL OR SNDMSG. I WOULD BE INTERESTED IN YOUR REACTION (OR
JEFF'S) TO THIS IDEA AND ALSO YOUR FEELING ABOUT THE MAGNITUDE OF
THE PROBLEM (MAYBE THERE'S NO REASON TO WORRY ABOUT THE DIALNET
TERMINALS TALKING ARPANET STYLE SINCE THEY CAN BE USED TO CALL
UP EXISTING ARPANET MESSAGE SYSTEMS VIA TIPS OR OTHER MEANS OF
ACCESS INTO THE NET, BEHAVING LIKE ORDINARY TERMINALS.
CHEERS.
VINT
∂13-FEB-76 1210 JMC
To: REM
I need to talk to you; please phone.
∂13-FEB-76 0134 JMC Grumbling about slow machine
To: RHT
The machine was slow tonight, because two people were hacking LIFE and
using up more time than anyone else. I chased one off half an hour
ago and am chasing another off now. However, anyone can notice such
things and ask them to stop.
∂13-FEB-76 0132 JMC LIFE
To: EJG
LIFE is a big gobbler of computer time and you are the second person
tonight using substantial computer time running it. At least one
person doing useful work has quit, because the machine was crowded.
Please convince me that what you are doing is useful for the AI Lab
or else stop.
∂13-FEB-76 0105 JMC LIFE
To: DON
You are the current biggest user of time, and at least one person
doing useful work has quit because the machine is crowded.
Either convince me that running LIFE has value to the AI Lab
or please stop.
∂13-FEB-76 0104 JMC
To: DON
Are you running a program for Conway's LIFE game?
∂13-FEB-76 0100 JMC
To: REM, LES
I am satisfied with your work, and am agreeable to another month at
3/4 time, but I clear all financial commitments with Les who gets
a copy of this.
∂12-FEB-76 2320 JMC
To: LES
It is now past time on Dialnet.
∂12-FEB-76 2105 JMC
To: REM
Ok. These are based on some common words. ( him), ( they), ( their)
( there) ( cann). Please add them to the file and try WUTHER
again.
∂12-FEB-76 2013 JMC
To: REM
I have had a few thoughts: First the numbers from WUTHER and GRIMM indicate
that the using a larger tree would produce more compression than
the increased size of tables would lose. So, if you can devise a
fast way to increase the tree, there would be payoff. Second, after
the current version is working it might be worthwhile to experiment
with a word oriented cruncher. Third, I am sending you the McCreight
paper, but it isn't clear to me that it is apropos. Fourth, I have
been thinking about algorithms for finding repetitions of long sequences
in large files, but I haven't come to a definite conclusion yet.
Some experiments may be necessary.
∂12-FEB-76 1102 JMC CS226
To: PAW
Please find out the CS226 directories by doing DI[226,*] and ask
Les to legitimize them.
∂12-FEB-76 1025 JMC
To: omalley @ SRI-AI
There will be two of McCarthy at King Tsin and at Minsky talk.
∂12-FEB-76 0909 JMC REM
To: REG
Don't purge REM; his file cruncher is almost done.
∂11-FEB-76 2144 JMC Compression
To: DDG
Thanks for the copy of the Mommsen and Raviv report. It looks like
their scheme is more limited than the one Robert Maas (REM) is using,
because they seem to use only one character left contexts. I am
somewhat surprised, however, that they don't seem to have actually
implemented the scheme in a utility program or have definite
estimates of the compression achieved. This may be because of their
orientation towards patentable hardware, though their software
timings make software compression look quite useful in a time-sharing
system. Ed McCreight at Xerox PARC told me of another scheme that
involves making some kind of tree of sequences of characters so that
repeated sequences can be replaced by references to their first
occurrences. It looks to me like this can be combined with the
scheme that REM is using.
∂11-FEB-76 1922 JMC
To: LES, ZM, waldinger @ SRI-AI, HVA
Congratulations on getting through the Stanford bureaucracy.
∂11-FEB-76 0110 JMC
To: REM
These ideas seem good, but I would like to begin with a simple
utility program without assuming any system changes. System
changes are very expensive right now, because of other changes
associated with the KL-10.
∂10-FEB-76 1737 JMC
To: REM
Don Knuth pointed me at Dick Sweet at Xerox who pointed to Ed McCreight
also at Xerox who told me that he had implemented a cruncher that
remembered all repeated strings in the text and outputted a text that
replaced the repetitions of long enough strings by pointers to the
first occurence. The decompressor is easy, but there is a fancy tree
generating technique in the compressor for finding the repeated strings.
According to McCreight it works well for BCPL programs, but not so
well for English texts, but he used smaller English texts. On the
face of it, it would appear that your technique and McCreight's could
be combined. His telephone number is 494-4462, and he has promised
to send me a reprint. I guess I think you should proceed as you are
going for now. There are some IBM leads that Dave Grossman is checking
for me, but that's all.
∂10-FEB-76 1502 JMC
To: PAW
stoyan.le1[let ... is the answer to Soyan's latest.
∂10-FEB-76 1359 JMC
To: masinter @ PARC-MAXC
Friday at 4pm would be fine, otherwise telephone.
∂10-FEB-76 0006 JMC
To: REM
OK.
∂09-FEB-76 2217 JMC wuther
To: REM
I looked at the wuther statistics, and it looks quite good. Do you think there
might be anything to gain by taking yet more left context?
∂09-FEB-76 2012 JMC
To: WD
Half and half and Vera was wondering.
∂09-FEB-76 1404 JMC
To: PAW
Addendum to previous: We would still need Suppes machine for CS206.
∂09-FEB-76 1357 JMC Note to Gene Franklin
To: PAW
Dear Gene:
In my opinion, buying a PDP-11/70 for student time-sharing is
like buying a 200 pound canary. I will elaborate if you like.
John McCarthy
∂09-FEB-76 0041 JMC Imlac
To: TED
Carrying out our promise to put an Imlac in CSD office has fairly high priority.
∂08-FEB-76 1348 JMC
To: REM
True, and maybe we want to revive them together with ? proper writeup.
∂07-FEB-76 1912 JMC National Engine Removal Week
To: WD
I hear that next week has been proclaimed National Engine Removal Wk.
∂07-FEB-76 1444 JMC
To: cerf @ USC-ISI
We need to go ahead on the Dialnet proposal and Les says you haven't
been responding to mail on the subject. If we don't hear from you
by Wednesday, we will proceed with the original draft.
∂07-FEB-76 1401 JMC
To: REG
Your proposal needs substantial improvement - including in tact.
∂06-FEB-76 1729 JMC
To: FXB
Why is an 11-70 like a 200 pound canary?
∂06-FEB-76 1611 JMC
To: LES
I forget why, but I want to keep Phil Wadler PLW legit till April.
∂06-FEB-76 1459 JMC
To: ZM
I need to talk to you about Igarash's work, because I am writing
a reference for him.
∂06-FEB-76 1206 JMC
To: PHON[ESS,JMC]
Buchanan, Jack 202 393-1640 x506
∂06-FEB-76 0946 JMC crunch
To: REM
Peter Neumann called me back and referred me to Bill Kautz at SRI who
said he would look up a few papers. Let me suggest that you telephone
Bill Kautz on Tuesday to see what he knows both about the techniques
themselves and the references. No-one seems to know about any general
crunching programs so maybe this will be the first utility program
for general use in a time-sharing system -strange as that may seem.
If so, a short article should be written.
∂06-FEB-76 0932 JMC
To: PHON[ESS,JMC]
Huffman 429-2476 office 423-1829 home
∂06-FEB-76 0930 JMC
To: REM
I would like you to try one of the books WUTHER or GRIMM on LIB,DOC both
with your present set of nodes and one optimized for the book. This is
more to get an estimate of the condensation to be expected with books
than for the purpose of crunching these two. The amount of crunching you
get is acceptable, but how much computer time does the process take? I
talked to Huffman this morning, and he said he didn't know the current
state of the art but thought that 50% was about right for a practical
technique and referred me to Peter Neumann at SRI. Neumann thought that
perhaps we might be able to do somewhat better but wasn't sure and said
he would call me back if he had any suggestions.
You might also think about what the commands for crunching and
uncrunching and spindling should look like to the user.
∂05-FEB-76 1914 JMC
To: REM
Well, that's surprisingly good!
∂05-FEB-76 1027 JMC
To: REM
Perhaps you should crunch them, but I suppose there isn't much redundancy.
∂03-FEB-76 1547 JMC
To: ZM, RWW
Let's do it
∂03-FEB-76 0049 JMC Deleting mail box
To: ellis @ USC-ISI
Please delete the mail box mccarthy at isi. I have long since
given up the account, and it only attracts occasional mail
that I can't get at.
If you aren't the right person for this request, please
redirect it.
Best regards,
John McCarthy
∂03-FEB-76 0048 JMC
To: mccarthy @ USC-ISI
foo
∂03-FEB-76 0047 JMC
To: mccarth @ USC-ISI
foo
∂01-FEB-76 1822 JMC
To: hqm @ MIT-AI
Yes, we can do that, and HQM will be fine. For how long do you want it?
The name will be for your personal use only - no friends, and we may have
to limit the non-trivial use of the PC program to slack hours. Depending
on when you come and how fast things go, there may be substantial downtime
due to installation of KL-10 processor.
∂01-FEB-76 0133 JMC Your last message
To: REM
I just noticed your last message disappearing off the top of
my screen. I had left without logging out.
∂31-JAN-76 2017 JMC
To: REM
Why do you come in through mathlab?
∂31-JAN-76 1845 JMC
To: REM
A crunch ratio of 45% (As I understand it, this means that
the crunched file has 45% as many bits as the source.) is good enough
for practical purposes provided the overhead from the tables used
for the crunching doesn't bring the ratio above 50% or if a fixed
table can be used for all text files. One might consider a special
monument to justification in justified files where one doesn't distinguish
the number of spaces except after periods for lines that have 65 or
whatever total characters. I don't know if this would make a useful
difference. What does the computation time look like and the size
of the job that does the crunching and uncrunching.
∂31-JAN-76 1504 JMC UNKNOWN
To: LES
Who is Jeff Rosen, logged in as JMR, who says you let him in to
"to do a document on pattern classifiers for Prof. Cerf". If
"do a document" means using PUB this may cost more than is cost-effective
for us.
∂31-JAN-76 1246 JMC
To: ELM
Everyone is eager for you to do it.
∂31-JAN-76 0009 JMC
To: JJK
I assume there will be a transparency projector, though I am not
sure I will use it. By the way, precisely when and where am I
scheduled to talk.
∂30-JAN-76 1135 JMC
To: LES
KL10 shipped?
∂29-JAN-76 1718 JMC
To: PAW
Please confirm this for me.
02-10 Linguistics group, Dreyfus on formal models 8pm dinner 6pm
Clubroom, Strawberry Canyon Recreation Area UCB
confirm to Mrs. Larue Seegmiller 642-2757
∂29-JAN-76 1507 JMC
To: LES
Derek Oppen is pressing for some feedback on possible continuation.
Oh well, let's do it.
∂29-JAN-76 1430 JMC
To: RWW
ARE ANY STUDENTS USING FOL?
Yes
∂29-JAN-76 1252 JMC
To: LES
No, but let's make Cordell feel a bit guilty about feathering the nests
of his graduate students. I guess I didn't understand that they
were all to get home terminals.
∂29-JAN-76 1247 JMC
To: LES, TED, REG, HVA
I suggest that we simply stall until the KL-10 is installed and
see how hot the room gets and extrapolate to summer conditions.
∂29-JAN-76 1239 JMC
To: PAW
I need to change Scott Wakefield's grade in CS206 to A.
∂29-JAN-76 0933 JMC
To: RHT
The letter is sense.le3[let,jmc] and the announcement is sense.xgp[w76,jmc].
∂28-JAN-76 2326 JMC
To: ME
Am I mistaken, or is type out from E using "x ty" much faster
than type-out from NS?
∂28-JAN-76 2149 JMC
To: RAK
We are counting on you for poster posting.
∂28-JAN-76 2050 JMC
To: REM
OK. All these approaches seem plausible.
∂28-JAN-76 1456 JMC
To: CALEND[ESS,JMC]
01-28 10:30 Lieberman, his place
∂28-JAN-76 1454 JMC
To: CALEND[ESS,JMC]
01-28 10:30 Lieberman, his place
∂28-JAN-76 1054 JMC
To: Omalley @ SRI-AI
I expect be attend BAAIC in Feb.
∂28-JAN-76 1052 JMC
To: CALEND[ESS,JMC]
02-18 BAAIC 6pm King Tsin 1669 Solano Bkly, Minsky AI Coherence Problem
∂28-JAN-76 0131 JMC
To: RWW
When the syntax of axioms is next revised consider the fact that
when an assertion is moved from one axiom to another, one cannot
simply attach the line and move it, but one has to tinker with
the punctuation at the end of the line changing it from a comma
to a pair of semicolons or vice versa and that this leads to
errors.
∂27-JAN-76 1653 JMC
To: REM
Yes, try History-tree crunching.
∂27-JAN-76 1536 JMC
To: REM
What about "the " and "qu" in hoter? Even so, it seems as if
there should have been more compression.
∂27-JAN-76 1312 JMC
To: mccarthy @ USC-ISI
foo
∂27-JAN-76 1305 JMC
To: REM
I am disappointed that there wasn't more compression. Can you
tell me a file that tells what tokens were used and what codes
they received so that I can readjust my intuitions or make
suggestions.
∂26-JAN-76 2328 JMC SENSE meeting
To: SENSE.LAB[W76,JMC]:;
The next meeting is Tues. Feb 3 at 7:30 in 270 Tresidder. Speakers
are Geo. Smoot from UCB on Am. Phys. Soc. study of reactor safety
and JMC on energy and ideology. Poster xgped. Volunteers needed to
put it up on campus. Russ, we need a letter to our mailing list. We
also need to notify Daily.
∂26-JAN-76 2255 JMC
To: RWW
Richard says that the validity of a sentence of set theory is
obviously decidable if it can be represented as a sentence in
∀...∀∃...∃.M where M is built up of ε ∪ ∩ \ {a,...,z} =. Language
may have individuals. Quantifiers range over sets and ?individuals.
More vaguely, some syntactically specified collection of
comprehension terms may appear. Maybe no quantifiers within the
comprehension terms.
∂26-JAN-76 1426 JMC
To: PHON[ESS,JMC]
Hieronymus 642-7453 and at home 549-1411.
∂25-JAN-76 1750 JMC
To: LES
Seem unlikely to me.
∂25-JAN-76 1552 JMC
To: ALS
Erratum?:p.14 l.33-should be "control and meta keys"
∂25-JAN-76 1550 JMC
To: ALS
SUBSTITUTION commands: ⊗\
String substitution commands are initiated by first giving a normal FIND
command but using the special string terminating character \
(back-slash), typed with both the <META> and the <CONTROL> keys
depressed. This is then followed by the substitution string which, in
turn, is terminated by either a simple carriage return (which may be
Erratum?:p.14 l.33-should be "control and meta keys"
preceeded by an argument, typed with control keys) or by <CONTROL><CR>.
Note, many of the otherwise acceptable Find command terminations are not
meaningful with the substitution commands and are not allowed.
Characters in the searched-for string that are preceeded by the special
control symbols ¬ and ≡ and all characters that are represented by the
special symbol ∀ or by the symbol | (see p. 13 for the explanation of
these symbols) are treated as any other character and are deleted and
replaced by the substitution string. The "partial definition feature"
as implemented in SOS is not, at present available.
Note. The FIND command does not find the very first symbol on the line
to which the cursor is pointing.
This limitation is of little consequence for the simple FIND but it
is an annoyance if one wants to replace all occurances of a symbol
(or string) which happens to be the very first symbol (or string) on
a page. One can introduce an initial space into the first line or
one can introduce an initial blank line temporarily and have the
cursor at this line. The space or line can then be removed after the
substitution.
In the rest of this write-up "all occurances" means "all except the very
first character or string on the line to which the cursor is pointing at
the time that the command is given".
Sample commands.
αβFSTRINGαβ\"String"αβ∞<CR> Find all occurances of the string
STRING, whether typed in lower or upper case
letters and replace them by the substitution
string as typed, that is, enclosed in quotes and
with the initial letter only in CAPS. Limit the
search to the current page starting at th cursor
location.
αXFIND ←αβ\ <BACK ARROW> α<CR> Find the first occurance
of the character ← whether on the current page
or a subsquent one and replace it by the string
<BACK ARROW> (including the < and >) and with
spaces introduced before and after these
characters. Leave the resulting line in the
Line-Editor.
The <CR> termination is the faster mode of operation in that it makes a
minimum use of the line editor and it is recommended. This mode does
have one defect in that the substitution is completed and is not subject
to the simple <ALT> method of aborting a single line correction. When
the <CONTROL><CR> termination is used the substitution is made via the
Line-Editor and the results are left in the Line-Editor's buffer so that
the substitution may still be aborted by the usual <ALT> command. This
takes time and certain timing difficulties sometimes cause trouble.
The usual rules apply to the specification of the searched-for string.
The substitution string may, however, contain certain delimiters (spaces
in particular) whether or not the search is for a delimited string and a
distinction is made between upper and lower case letters. Only the
searched-for letters without delimiters are replaced. To be specific, if
one were to replace a delimited string by a null substitution string,
the two delimiters would remain in the corrected text.
The substitution string is sticky, so that a substitution command, when
successfully executed for a single occurance, may be repeated for the
next occurence by typing αβ\ only. The typing of a new string for the
searched-for string destroys the record of the previously saved
substitution string and the entire request must be retyped before this
command will be honored.
A null substitution string may be used but only after confirmation has
been requested and received. The substitution will also be restricted to
a single occurance. It may then be repeated as many times as desired by
the usual repeat command with the desired argument. These precautions
can be removed if users find them bothersome, but it was thought wise to
put them in at first.
Multi-page substitutions are useful but potentially dangerous as the
substitutions made on any one page are, of course, written out onto the
disk file when ever a new page is entered.
As noted earlier, typing αβ\ after a successful single substitution will
repeat the substitution. This command may be preceeded by an argument
(with control bits) and the substitution will be repeated the specified
number of times. Should substitutions occur on more than one page, all
substitutions on pages earlier than the last page will have been written
out.
The use of the command α\ rather than αβ\ is also allowed but is not
recommended. This leaves the altered line in the line buffer with the
possibility of an <ALT> abort.
Sample repeat commands.
αβ\ Repeat the previously made substitution at the next
occurance of the searched-for string using the faster
and safer mode which does not leave the results in
the Line-Editor buffer.
αβ6αβ\ Repeat the substitution for the next 6 occurances.
α\ Repeat the substitution once but leave the results in
the Line-Editor buffer.
∂25-JAN-76 1240 JMC
To: RWW
Just noticed existence of OPPARs.
∂25-JAN-76 0028 JMC
To: TASKS.SET[ESS,JMC], RWW
It looks like I need operation parameters. Can I have them in FOL?
∂24-JAN-76 2051 JMC
To: RWW
Thanks for arith.dec.
∂24-JAN-76 1917 JMC Label and form printing.
To: LES
There is a survey in Datamation. It looks like the best buy is
a Decwriter especially as we can probably get it for $999, judging from
what Bob Henry said, assuming Stanford buys enough D.E.C. equipment
to qualify for a discount.
∂24-JAN-76 1903 JMC
To: filman @ CMU-10A
If you are applying here, I should write a letter of recommendation.
∂23-JAN-76 1657 JMC
To: REM
∂23-JAN-76 1649 REM via AMET
It is possible you merely got your names mixed up between dimension and crunch.
I don't think so. I think Mandelbrot did some theory on encoding natural language.
∂23-JAN-76 1652 JMC
To: REM
Well, that's the Mandelbrot I meant, but now that I think about it,
maybe his work in coding is obsoleted by Huffman.
∂23-JAN-76 1121 JMC
To: PHON[ESS,JMC]
Herson, Eugene Easley and Brassy Corp. 467-2552
∂23-JAN-76 0342 JMC
To: REM
The bugs are from a new system, so they may last a day or so.
∂23-JAN-76 0329 JMC
To: ME
That was it.
∂23-JAN-76 0245 JMC
To: ME
I'LL TRY THAT.
∂23-JAN-76 0039 JMC
To: ZM
It wasn't Wegbreit. It was Henderson (of Newcastle) and James Morris.
"A Lazy Evaluator" and it's in your box.
∂22-JAN-76 2337 JMC
To: TAG
The AMES-67 lists a card punch.
∂22-JAN-76 2319 JMC
To: TAG
I note from the ARPANET Resource Handbook that SUMEX has 9 track
DEC TU30 tapes and are on the net. I am sure we can arrange
to use them when necessary.
∂22-JAN-76 2307 JMC
To: REM
I think there should be several, but would like to see first the
one suited to documentation and essays in original manuscript.
∂22-JAN-76 2246 JMC
To: REM
Do you have any idea of the amount of crunching we will get yet?
∂22-JAN-76 1554 JMC
To: cerf @ USC-ISI
Well I guess I'll talk myself since you already have all the other
people. Title: Current issues in AI.
∂21-JAN-76 2126 JMC Send article
To: PAW
Please send a copy of "Ascribing Mental..." to Bob Smith at IMSSS. You will
find a bound copy in the file MENTAL in 2nd file drawer from top right cabinet.
∂21-JAN-76 1602 JMC letter
To: PAW
dertou.xgp should be printed and a xerox of kandel's latest included.
∂21-JAN-76 1542 JMC
To: REM
I don't care.
∂21-JAN-76 1535 JMC
To: PAW
Have we converted Luckham papers to Senior Research Associate?
∂21-JAN-76 1438 JMC
To: SGK
My comments are p.3 of your file.
∂21-JAN-76 1135 JMC SENSE
To: JH
I have taken the calendar announcement to Encina for Campus Report.
Do you have a telephone?
Can you make a poster?
What is the source file for the previous poster?
∂21-JAN-76 1106 JMC
To: REM
Get statistics for HOTER.ESS[ESS,JMC] and MENTAL[F75,JMC].
∂21-JAN-76 0352 JMC Xerox for Zohar
To: PAW
On my desk is a paper called the Lazy Evaluator. Please make a xerox
for Zohar.
∂21-JAN-76 0306 JMC Proofs
To: RWW
All proofs that used KELLEY.AX should be checked by
their authors to be sure that they didn't illegitimately
make things sets that were only defined to be classes.
∂21-JAN-76 0303 JMC FOL Manua5
To: PAW
Let the present version of the FOL manual be printed for my class,
but hold the AI memo version for additional changes.
∂21-JAN-76 0246 JMC
To: BG
Yup, and RUSSEL[W76,JMC] is Russell's paradox.
∂21-JAN-76 0245 JMC
To: RWW
RUSSEL[W76,JMC] is Russell's paradox proved from KELLEY.AX
∂21-JAN-76 0157 JMC
To: RWW
Yes, it's being printed.
∂21-JAN-76 0146 JMC {x} is a set.
To: BG
FOO[W76,JMC] is a proof of ∀x.SET({x}) from KELLEY.AX[AX,?WW].
You will note that something is very fishy about it, because
it doesn't use the definition of the unit set. What's fishy
is the very first step which lets me substitute {x} for a set
variable. Heh, heh. The theorem is built into the implicit
declarations of FOL. I wonder if it will let me substitute
{x|x=x} for a set variable. See the next exciting installment.
∂21-JAN-76 0039 JMC Imlac
To: TAG
This Imlac is losing badly on accuracy of transmission from the PDP-10.
Please determine prom?tly whether the trouble is there or here.
It seems to lose occasionally transmitting to the PDP-10. A characteristic
loss going from the 10 is that t's become p's.
The last two lines were transmitted back correctly.
But that one converted a space into .
The last was correct.
∂20-JAN-76 1641 JMC
To: carlstrom @ USC-ISI, russell @ USC-ISI
Rumor has it that you are coming on the 27th rather than on the 29th.
∂20-JAN-76 1501 JMC The meeting is Feb. 3 in Tresidder 270.
To: JH
Can you do publicity?
∂20-JAN-76 1440 JMC
To: JJK
It will be Luckham. Talk to him directly.
∂20-JAN-76 1433 JMC Proposal
To: waldinger @ SRI-AI
I need to know the subject of the book so that
I can be eloquent. There seem to be substantial
bureaucratic obstacles to be overcome.
∂20-JAN-76 1329 JMC
To: CALEND[ESS,JMC]
02-01 noon, Bechtel Center, Bay Area Council on Soviet Jewry
∂19-JAN-76 2339 JMC
To: JJK
I am asking Dave Luckham, but there hasn't been time for a reply.
∂19-JAN-76 2338 JMC
To: DCL
Can you talk on verification at the Computer forum in Feb?
∂19-JAN-76 2236 JMC
To: RWW
Page 11 was missing from the Jan. 17 version also.
∂19-JAN-76 1513 JMC
To: DEK
I can't help on Spencer.
∂19-JAN-76 1249 JMC
To: TED
I meant the tape drives
∂19-JAN-76 1248 JMC
To: TED
What about it, Ted?
∂18-JAN-76 2322 JMC Clea
To: VEW
She has done it again.
∂18-JAN-76 2322 JMC
To: ME
Thanks.
∂18-JAN-76 1755 JMC
To: RWW, BG
I have renamed KELLEY.AX←KELLY.AX and changed manual accordingly.
∂18-JAN-76 1533 JMC
To: ME
Sometimes within E, I would like to create another file
and transfer some text to it. One can't switch to a
non-existent file, but in the system one can mail to
a non-existent file which creates it. However, it
doesn't seem to work when mailing from within E. Is
there a fundamental reason why this should be so?
∂18-JAN-76 1527 JMC
To: FOO[W76,JMC]
test
∂18-JAN-76 1401 JMC Mental qualities of machines
To: RS
I am about 2/3 through a manuscript entitled "Ascribing
mental qualities to machines" and I have to put it aside
for a while. If you are interested in making comments
on present version, I'll send you a copy.
∂18-JAN-76 1354 JMC
To: REM
I am doubtful that scanning the file to produce the code will pay off,
∂18-JAN-76 0923 JMC
To: REM
I don't know any techniques, but I read that people devise algorithms
∂17-JAN-76 1419 JMC
To: RWW
CC: BG
I have made the following modifications to FOLMAN[DOC,RWW].
The references are specified by <source page>.<document page>, i.e.
the first change is on page 3 of the source file, but comes out on
page 1 of the final document.
p.3.1 corrected spelling of principal
changed syntax of sentence about not checking axioms
p.4.2 A paragraph comparing FOL declarations with those in a programming
language has been inserted.
p.4.3 The references to previous paragraphs have been made consistent
with the abolition of AUXSYM.
p.9.9 Renumbered quantification example as 4.12 for consistency
∂17-JAN-76 1216 JMC kelly.ax
To: RWW
There seem to be a few errors in kelly.ax. Definitions MIN and WO contain
the letter x as a free variable. I presume it should be a in both cases,
but even so, I don't understand the definition MIN, because it seems to
me that INTER(ON ∪ a) would always be λ since λ ε ON.
∂16-JAN-76 1708 JMC
To: PAW
Patte: Here is a message from Carl Hewitt.
Date: 16 JAN 1976 1918-EST
From: CARL at MIT-AI
To: jmc at SU-AI, rwg at SU-AI
For mathematical papers the favorite Roman font for text is
Baskerville with mathematics in News Gothic Bold. However,
many prefer a gothic text font which is not avaiable here in
30 height. So you must choose between a 25 height or a 31 height.
Good luck,
Carl
-------
∂16-JAN-76 1544 JMC
To: RHT
I now have another speaker, but I think we should put it off
for a week to Feb. 4 in order to have more time for publicity.
So would you try for Tresidder for that date.
∂16-JAN-76 1506 JMC
To: PAW
Please decorate toledo.le1 as a letter without titlles.
∂16-JAN-76 1324 JMC AUXSYMs, banishment thereof
To: RWW
I have done it and closed up the numbering, as we agreed should be done.
If you have second thoughts, ...
∂16-JAN-76 1142 JMC
To: RAK
Thanks. We'll have to see if something actually comes of it.
∂16-JAN-76 1024 JMC
To: LES
2π Monday is ok.
∂16-JAN-76 1017 JMC
To: PAW
Patte, pleae check into this:
∂16-JAN-76 0945 FTP:PRATT at MIT-AI
Date: 16 JAN 1976 1243-EST
From: PRATT at MIT-AI
To: JMC at SU-AI
My secretary defines 25FG characters as new math symbols not in the
SAIL set arise in my papers. Only takes a few minutes per character.
-------
∂16-JAN-76 1015 JMC
To: PAW
∂16-JAN-76 0945 FTP:PRATT at MIT-AI
Date: 16 JAN 1976 1243-EST
From: PRATT at MIT-AI
To: JMC at SU-AI
My secretary defines 25FG characters as new math symbols not in the
SAIL set arise in my papers. Only takes a few minutes per character.
-------
∂16-JAN-76 0035 JMC
To: ELM
No, Patty is just storing them there temporarily.
∂15-JAN-76 1537 JMC
To: RHT
Can you get us a room in Tressider for 28 Jan.?
∂24-JAN-76 1919 JMC prev. message
To: LES
This is assuming we don't get the free ones.